A Novel Genetic Algorithm based Approach for Optimization of Distance Matrix for Phylogenetic Tree ConstructionA Novel Genetic Algorithm based Approach for Optimization of Distance Matrix for Phylogenetic Tree Construction

نویسندگان

  • Mridu Gupta
  • Shailendra Singh
چکیده

Phylogenies are useful for organizing knowledge of biological diversity, for structuring classifications, and for providing knowledge of events that occurred during evolution. Different phylogenetic reconstruction techniques are available. In this paper Distance based technique is used. Distance measure is an important issue in phylogenetic analysis. Traditional approaches are time-consuming due to the fact that they require multiple sequence alignment, while the K-tuple distance is easy to compute and has been used in phylogenetic tree reconstruction. Based on this Ktuple distance, a genetic algorithm is proposed to find a new F-tuple distance measure which takes into account the position of occurrence of tuples and instead of considering difference, similarities between the sequences are considered. The K-tuple distance approach is not effective for set of sequences which are almost identical where as F-tuple distance is useful for constructing phylogenetic tree for set of identical sequences. This novel approach is capable of efficiently building phylogenetic trees and is less computational intensive.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Genetic Algorithm based Approach for Optimization of Distance Matrix for Phylogenetic Tree Construction

Phylogenies are useful for organizing knowledge of biological diversity, for structuring classifications, and for providing knowledge of events that occurred during evolution. Different phylogenetic reconstruction techniques are available. In this paper Distance based technique is used. Distance measure is an important issue in phylogenetic analysis. Traditional approaches are time-consuming du...

متن کامل

A Mixed Integer Programming Approach to Optimal Feeder Routing for Tree-Based Distribution System: A Case Study

A genetic algorithm is proposed to optimize a tree-structured power distribution network considering optimal cable sizing. For minimizing the total cost of the network, a mixed-integer programming model is presented determining the optimal sizes of cables with minimized location-allocation cost. For designing the distribution lines in a power network, the primary factors must be considered as m...

متن کامل

A Novel Methodology for Structural Matrix Identification using Wavelet Transform Optimized by Genetic Algorithm

With the development of the technology and increase of human dependency on structures, healthy structures play an important role in people lives and communications. Hence, structural health monitoring has been attracted strongly in recent decades. Improvement of measuring instruments made signal processing as a powerful tool in structural heath monitoring. Wavelet transform invention causes a g...

متن کامل

A Novel Technique for Steganography Method Based on Improved Genetic Algorithm Optimization in Spatial Domain

This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...

متن کامل

A knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012